A Note on Occur-Check
نویسندگان
چکیده
Most known results on avoiding the occur-check are based notion of "not subject to occur-check" (NSTO). It means that unification is performed only such pairs atoms for which never succeeds in any run a nondeterministic algorithm. Here we show this requirement too strong. We how weaken it, and present some related sufficient conditions under may be safely omitted. examples proposed approach provides more general than approaches well-moded nicely moded programs (this includes cases latter inapplicable).
منابع مشابه
A Comparison of Three Occur-Check Analysers
A well known problem of most Prolog interpreters and compilers is the lack of occur-check in the implementation of the uniication algorithm. This means that such systems are unsound with respect to rst-order predicate logic. Static analysis ooers an appealing approach to the problem of occur-check reduction, that is, how to safely omit occur-checks in uniication. We compare, for the rst time, t...
متن کاملLogic Programming with the Occur-check
We present a new procedure based on abstract interpretation for determining where the occur-check may be safely omitted from uniication in an SLD-derivation. The procedure can be used by compilers that allow co-routining and by parallel implementations. It has been designed primarily for a typed language such as GG odel where the type information can be used to improve both the accuracy of the ...
متن کاملA Note on Low Density Parity Check Codes for Erasures and Errors
We analyze low density parity check codes that correct both errors and erasures using a simple decoding scheme. Our framework unifies previous analyses for low density parity check codes and erasure codes. The result is a general class of codes that corrects both errors and erasures, with corresponding simple linear time encoding and decoding algorithms and provable performance guarantees. We a...
متن کاملA note on vague graphs
In this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. Also, density and balanced irregular vague graphs are discussed and some of their properties are established. Finally we give an application of vague digraphs.
متن کاملA note on lifting projections
Suppose $pi:mathcal{A}rightarrow mathcal{B}$ is a surjective unital $ast$-homomorphism between C*-algebras $mathcal{A}$ and $mathcal{B}$, and $0leq aleq1$ with $ain mathcal{A}$. We give a sufficient condition that ensures there is a proection $pin mathcal{A}$ such that $pi left( pright) =pi left( aright) $. An easy consequence is a result of [L. G. Brown and G. k. Pedersen, C*-algebras of real...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic proceedings in theoretical computer science
سال: 2021
ISSN: ['2075-2180']
DOI: https://doi.org/10.4204/eptcs.345.17